Computing Casimir invariants from Pffafian systems
نویسندگان
چکیده
منابع مشابه
Computing Local Invariants of Qubit Systems
We investigate means to describe the non-local properties of quantum systems and to test if two quantum systems are locally equivalent. For this we consider quantum systems that consist of several subsystems, especially multiple qubits, i. e., systems consisting of subsystems of dimension two. We compute invariant polynomials, i. e., polynomial functions of the entries of the density operator w...
متن کاملComputing local invariants of quantum-bit systems
We investigate means to describe the nonlocal properties of quantum systems and to test if two quantum systems are locally equivalent. For this we consider quantum systems that consist of several subsystems, especially multiple quantum bits, i.e., systems consisting of subsystems of dimension 2. We compute invariant polynomials, i.e., polynomial functions of the entries of the density operator ...
متن کاملCasimir Invariants and Characteristic Identities for Gl(∞)
A full set of (higher order) Casimir invariants for the Lie algebra gl(∞) is constructed and shown to be well defined in the category O F S generated by the highest weight (unitarizable) irreducible representations with only a finite number of non-zero weight components. Moreover the eigenvalues of these Casimir invariants are determined explicitly in terms of the highest weight. Characteristic...
متن کاملComputing with Matrix Invariants
This is an improved version of the talk of the author given at the Antalya Algebra Days VII on May 21, 2005. We present an introduction to the theory of the invariants under the action of GLn(C) by simultaneous conjugation of d matrices of size n × n. Then we survey some results, old or recent, obtained by a dozen of mathematicians, on minimal sets of generators, the defining relations of the a...
متن کاملComputing Differential Invariants of Hybrid Systems as Fixedpoints
We introduce a fixedpoint algorithm for verifying safety properties of hybrid systems with differential equations that have right-hand sides that are polynomials in the state variables. In order to verify non-trivial systems without solving their differential equations and without numerical errors, we use a continuous generalization of induction, for which our algorithm computes the required di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics Letters A
سال: 1999
ISSN: 0375-9601
DOI: 10.1016/s0375-9601(99)00600-3